Decentralized optimal tracking control for large-scale nonlinear systems with tracking error constraints

In this article, a decentralized optimal tracking control strategy is proposed for a class of nonlinear systems with tracking error constraints by utilizing adaptive dynamic programming (ADP). It should be noted that ADP technology cannot be directly used to solve decentralized optimal tracking problem of large-scale interconnected nonlinear system with nonzero equilibrium points, since that an infinite domain performance index function may result in an unsolvable solution. In addition, by introducing a smooth function, the constrained tracking error is transformed into an unconstrained one. Then, the error dynamics and a new infinite domain performance index function are designed, such that ADP technology can be used. Following the designed performance index function, the tracking error can be ensured within a small neighborhood of zero. Finally, the feasibility and the effectiveness of the proposed decentralized optimal control scheme are verified through two simulation examples.     

双层过道布置问题的混合整数非线性规划模型及两阶段改进模拟退火算法

结合实际布局活动中，设施在多层空间布置的实际情况，提出了双层过道布置问题，并构建了该问题的混合整数非线性规划（MINLP）模型。针对问题特征，提出了一种改进模拟退火算法，通过采用两阶段改进策略，对退火过程及抽样过程进行改进。该算法以自适应搜索策略替代马氏链搜索长度，并引入记忆功能、回火操作以提高求解质量，通过设置双阈值来提高求解效率。应用所提算法对24个基准算例进行测试，并将其与原模拟退火算法和GUROBI精确方法作对比，验证了所提算法的有效性。     

基于学科竞赛的中医药类院校程序设计课程教学模式的探索

高素质人才培养是我国可持续发展战略、科教兴国战略以及人才强国战略等多项发展战略的一项基础性工程。本文针对中医药类院校程序设计类课程实践教学模式单一等教学实际，以“学科竞赛”为平台，“赛教结合”为理念，以《C语言程序设计》为例，从现存问题、赛教结合模式的引入、建立实施及其评价机制4个方面展开阐述，旨在提高学生学习积极性和能力。     

A dual Newton strategy for tree‐sparse quadratic programs and its implementation in the open‐source software treeQP

This paper presents a dual Newton scheme for tree‐sparse quadratic programs as they may arise in the field of stochastic programming. Previous work suggests to introduce auxiliary variables to decompose the tree into scenarios and use Newton's method to solve a dual problem formulation. Following a different approach, we apply the same principle directly on the tree‐sparse problem, avoiding the increase in dimensionality. In combination with a tailored algorithm for the calculation of the step direction, which is typically the most expensive operation per iteration, the proposed algorithm achieves a linear complexity in the number of nodes and supports parallel processing of the tree branches in a stage‐wise fashion. An open‐source implementation of the presented dual Newton strategy is publicly available in treeQP , a toolbox of open‐source solvers for tree‐sparse quadratic programs.     

Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

The minimum cost flow problem (MCFP) is the most generic variation of the network flow problem which aims to transfer a commodity throughout the network to satisfy demands. The problem size (in terms of the number of nodes and arcs) and the shape of the cost function are the most critical factors when considering MCFPs. Existing mathematical programming techniques often assume the cost functions to be linear or convex. Unfortunately, the linearity and convexity assumptions are too restrictive for modelling many real-world scenarios. In addition, many real-world MCFPs are large-scale, with networks having a large number of nodes and arcs. In this paper, we propose a probabilistic tree-based genetic algorithm (PTbGA) for solving large-scale minimum cost integer flow problems with nonlinear non-convex cost functions. We first compare this probabilistic tree-based representation scheme with the priority-based representation scheme, which is the most commonly-used representation for solving MCFPs. We then compare the performance of PTbGA with that of the priority-based genetic algorithm (PrGA), and two state-of-the-art mathematical solvers on a set of MCFP instances. Our experimental results demonstrate the superiority and efficiency of PTbGA in dealing with large-sized MCFPs, as compared to the PrGA method and the mathematical solvers.     

Uncertain location–allocation decisions for a bi-objective two-stage supply chain network design problem with environmental impacts

In the cases that the historical data of an uncertain event is not available, belief degree-based uncertainty theory is a useful tool to reflect such uncertainty. This study focuses on uncertain bi-objective supply chain network design problem with cost and environmental impacts under uncertainty. As such network may be designed for the first time in a geographical region, this problem is modelled by the concepts of belief degree-based uncertainty theory. This article is almost the first study on belief degree-based uncertain supply chain network design problem with environmental impacts. Two approaches such as expected value model and chance-constrained model are applied to convert the proposed uncertain problem to its crisp form. The obtained crisp forms are solved by some multi-objective optimization approaches of the literature such as TH, Niroomand, MMNV. A deep computational study with several test problems are performed to study the performance of the crisp models and the solution approaches. According to the results, the obtained crisp formulations are highly sensitive to the changes in the value of the cost parameters. On the other hand, Niroomand and MMNV solution approaches perform better than other solution approaches from the solution quality point of view.     

Maternal Malnutrition Affects Hepatic Metabolism through Decreased Hepatic Taurine Levels and Changes in HNF4A Methylation

Fetal programming implies that the maternal diet during pregnancy affects the long-term health of offspring. Although maternal diet influences metabolic disorders and non-alcoholic fatty liver disease in offspring, the hepatic mechanisms related to metabolites are still unknown. Here, we investigated the maternal diet-related alterations in metabolites and the biological pathway in male offspring at three months of age. Pregnant rats were exposed to 50% food restriction during the prenatal period or a 45% high-fat diet during the prenatal and postnatal periods. The male offspring exposed to food restriction and high-fat diets had lower birth weights than controls, but had a catch-up growth spurt at three months of age. Hepatic taurine levels decreased in both groups compared to controls. The decreased hepatic taurine levels in offspring affected excessive lipid accumulation through changes in hepatocyte nuclear factor 4 A methylation. Moreover, the alteration of gluconeogenesis in offspring exposed to food restriction was observed to a similar extent as that of offspring exposed to a high fat diet. These results indicate that maternal diet affects the dysregulation in hepatic metabolism through changes in taurine levels and HNF4A methylation, and predisposes the offspring to Type 2 diabetes and non-alcoholic fatty liver disease in later life.     

Design of energy‐efficient train speed profiles considering fixed‐block signaling system

In dense traffic railway networks, trains may often slow down or stop between stations owing to previous train delays. If preceding train trajectory can be predicted, energy‐efficient driving can be achieved by suppressing unnecessary speed changes. In this paper, we propose an algorithm to find energy‐efficient driving considering fixed‐block signaling (FBS) system by using dynamic programming (DP). DP is suitable for use because it can optimize the control inputs with discrete and state constraints. In this paper, we discuss energy‐efficient driving by considering a FBS system using some case studies of simulation. In the simulation, we examine a technique to drive an express train in an energy‐efficient way when the preceding local train is running toward the station with passing loops. The results show that the proposed method can derive complex speed profiles for energy‐efficient driving and the train can be operated with a maximum reduced energy consumption of 8.3%.     

The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation,a Benders decomposition and a CP-based algorithm

This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of this variant are (i) the object contains some defects, and the items cut must be defective-free; (ii) there is an upper bound on the number of times an item type may appear in the cutting pattern; (iii) the number of guillotine stages is not restricted. This problem commonly arises in industrial settings that deal with defective materials, e.g. either by intrinsic characteristics of the object as in the cutting of wooden boards with knotholes in the wood industry, or by the manufacturing process as in the production of flat glass in the glass industry. We propose a compact integer linear programming (ILP) model for this problem based on the discretisation of the defective object. As solution methods for the problem, we develop a Benders decomposition algorithm and a constraint-programming (CP) based algorithm. We evaluate these approaches through computational experiments, using benchmark instances from the literature. The results show that the methods are effective on different types of instances and can find optimal solutions even for instances with dimensions close to real-size.     

A new DEA common-weight multi-criteria decision-making approach for technology selection

This paper addresses an advanced manufacturing technology selection problem by proposing a new common-weight multi-criteria decision-making (MCDM) approach in the evaluation framework of data envelopment analysis (DEA). We improve existing technology selection models by giving a new mathematical formulation to simplify the calculation process and to ensure its use in more general situations with multiple inputs and multiple outputs. Further, an algorithm is provided to solve the proposed model based on mixed-integer linear programming and dichotomy. Compared with previous approaches for technology selection, our approach brings new contributions. First, it guarantees that only one decision-making unit (DMU) (referring to a technology) can be evaluated as efficient and selected as the best performer while maximising the minimum efficiency among all the DMUs. Second, the number of mixed-integer linear programs to solve is independent of the number of candidates. In addition, it guarantees the uniqueness of the final optimal set of common weights. Two benchmark instances are used to compare the proposed approach with existing ones. A computational experiment with randomly generated instances is further proceeded to show that the proposed approach is more suitable for situations with large datasets.